Partially walking a polygon

Polygon Clipping and Polygon Reconstruction

Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. Afte...

Partially Overlapping Primer-Based PCR for Genome Walking

Current genome walking methods are cumbersome to perform and can result in non-specific products. Here, we demonstrate the use of partially overlapping primer-based PCR (POP-PCR), a direct genome walking technique for the isolation of unknown flanking regions. This method exploits the partially overlapping characteristic at the 3' ends of a set of POP primers (walking primers), which guarantees...

Finding the Maximum Area Centrosymmetric Polygon in a Convex Polygon

Coherent and Exact Polygon-to-Polygon Visibility

Visibility computation is a classical problem in computer graphics. A wide variety of algorithms provides solutions with a different accuracy. However, the four dimensional nature of the 3D visibility has prevented for a long time from leading to exact from-polygon visibility algorithms. Recently, the two first tractable solutions were presented by Nirenstein, then Bittner. Their works give the...

Triangulating a Polygon in Parallel

In this paper we present a.n efficient pa.ra.Ilel algorithm. for polygon tria.ngu.Ia.tion. The algo-rithm we present runs in O(logn) time using D(n) processors, which is optimal if the polygon is allowed to contain holes. This improves the previous parallel complexity bounds for this problem by a log n factor. If we are also given a trapezoidal decomposition of the polygon as input, then we can...